Pseudorandom Number Generation: Impossibility and Compromise
نویسندگان
چکیده
Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudorandom number generators such as the Mersenne Twister are freely avail-
منابع مشابه
Impossibility and Optimality Results on Constructing Pseudorandom Permutations
Let I n = f0; 1g n , and H n be the set of all functions from
متن کاملLimits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators
The standard approach for constructing a large-stretch pseudorandom generator given a one-way permutation or given a smaller-stretch pseudo-random generator involves repeatedly composing the given primitive with itself. In this paper, we consider whether this approach is necessary, that is, whether there are constructions that do not involve composition. More formally, we consider black-box con...
متن کاملBackdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
Inspired by the Dual EC DBRG incident, Dodis et al. (Eurocrypt 2015) initiated the formal study of backdoored PRGs, showing that backdoored PRGs are equivalent to public key encryption schemes, giving constructions for backdoored PRGs (BPRGs), and showing how BPRGs can be “immunised” by careful post-processing of their outputs. In this paper, we continue the foundational line of work initiated ...
متن کاملQuantum Permanent Compromise Attack to Blum-Micali Pseudorandom Generator
This paper presents a quantum permanent compromise attack to the Blum-Micali pseudorandom generator whose security is based on the assumption of intractability of the discrete logarithm problem. The proposed attack makes use of the Grover’s quantum search extension for multiple solutions and of quantum parallelism to recover the generator’s internal state with high probability. This attack comp...
متن کاملSome Methods of Parallel Pseudorandom Number Generation
We detail several methods used in the production of pseudorandom numbers for scalable systems. We will focus on methods based on parameterization, meaning that we will not consider splitting methods. We describe parameterized versions of the following pseudorandom number generation: 1. linear congruential generators 2. linear matrix generators 3. shift-register generators 4. lagged-Fibonacci ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 12 شماره
صفحات -
تاریخ انتشار 2006